Multiscale Couplings In Prototype Hybrid Deterministic/Stochastic Systems: Part I, Deterministic Closures
نویسندگان
چکیده
منابع مشابه
Multiscale Couplings in Prototype Hybrid Deterministic/stochastic Systems: Part Ii, Stochastic Closures∗
Couplings of microscopic stochastic models to deterministic macroscopic ordinary and partial differential equations are commonplace in numerous applications such as catalysis, deposition processes, polymeric flows, biological networks and parametrizations of tropical and open ocean convection. In this paper we continue our study of the class of prototype hybrid systems presented in [8]. These m...
متن کاملGuest editorial: hybrid systems, part I
We consider it a great privilege to introduce this two-part issue on Hybrid Systems to Discrete Event Dynamic Systems: Theory and Applications. Hybrid dynamical systems constitute an abstract modeling framework for systems with bi-layer dynamics: time-driven dynamics at the lower layer, and discrete-event dynamics at the upper layer. This framework provides useful analysis techniques and simula...
متن کاملTime-Deterministic Hybrid Transition Systems
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode { an algebraic or di erential equation for each state variable in terms of inputs and other state variables. Each discrete transition may be taken according to a (non-deterministic) time constraint. In this paper we restrict this model to time-deterministic discrete transitions. T...
متن کاملAlgorithmic analysis of polygonal hybrid systems, part I: Reachability
In this work we are concerned with the formal verification of two-dimensional non-deterministic hybrid systems, namely polygonal differential inclusion systems (SPDIs). SPDIs are a class of nondeterministic systems that correspond to piecewise constant differential inclusions on the plane, for which we study the reachability problem. Our contribution is the development of an algorithm for solvi...
متن کاملOn the Power of Deterministic Transitive Closures
We show that transitive closure logic (FO + TC) is strictly more powerful than deterministic transitive closure logic (FO + DTC) on nite (unordered) structures. In fact, on certain classes of graphs, such as hypercubes or regular graphs of large degree and girth, every DTC-query is bounded and therefore rst order expressible. On the other hand there are simple (FO + pos TC) queries on these cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2004
ISSN: 1539-6746,1945-0796
DOI: 10.4310/cms.2004.v2.n2.a7